-
1 Planarverfahren
Deutsch-Englisch Wörterbuch der Elektrotechnik und Elektronik > Planarverfahren
-
2 технология
approach, art, engineering, method, practice, ( технического обслуживания) procedure, process, processing, technique, technology* * *техноло́гия ж.1. ( научная дисциплина) production [manufacturing] engineering2. (совокупность методов обработки, изготовления и т. п.) production [manufacturing] process, know-how (practice)3. (метод, способ) technologyтехноло́гия вы́плавки ста́ли — steelmaking practiceтехноло́гия изготовле́ния — manufacturing methods; fabrication practiceтехноло́гия интегра́льных схем — integrated-circuit [IC] technologyплана́рная техноло́гия полупр. — planar technologyтехноло́гия произво́дства — (production) practiceтехноло́гия до́менного произво́дства — blast-furnace operation practiceтехноло́гия машинострое́ния — manufacturing engineeringтехноло́гия сва́рки — welding techniques and procedures, welding practiceсудострои́тельная техноло́гия — shipyard practiceхими́ческая техноло́гия — chemical engineering* * *
См. также в других словарях:
Four color theorem — Example of a four colored map A four colori … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
chemical bonding — ▪ chemistry Introduction any of the interactions that account for the association of atoms into molecules, ions, crystals, and other stable species that make up the familiar substances of the everyday world. When atoms approach one another … Universalium
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
hydrocarbon — hydrocarbonaceous, adj. /huy dreuh kahr beuhn, huy dreuh kahr /, n. any of a class of compounds containing only hydrogen and carbon, as an alkane, methane, CH4, an alkene, ethylene, C2H4, an alkyne, acetylene, C2H2, or an aromatic compound,… … Universalium
Linkage (mechanical) — This article is about assemblies of links designed to manage forces and movement. For other uses, see Linkage. Variable stroke engine (Autocar Handbook, Ninth edition) A mechanical linkage is an assembly of bodies connected together to manage… … Wikipedia
Distributed element filter — Figure 1. A circuit featuring many of the f … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Chromatography — Pictured is a sophisticated gas chromatography system. This instrument records concentrations of acrylonitrile in the air at various points throughout the chemical laboratory. Chromatography (from Greek χρῶμα chroma color and γράφειν graphein to… … Wikipedia
number game — Introduction any of various puzzles and games that involve aspects of mathematics. Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… … Universalium